Fast verification, testing, and generation of large primes
نویسندگان
چکیده
منابع مشابه
Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes
Infinite sets P and Q of primes are described, P C Q. For any natural number n it can be decided if n e P in (deterministic) time 0((logn)9). This answers affirmatively the question of whether there exists an infinite set of primes whose membership can be tested in polynomial time, and is a main result of the paper. Also, for every n € Q, we show how to randomly produce a proof of the primality...
متن کاملFast Generation of Random, Strong Rsa Primes
A number of cryptographic standards currently under development call for the use of strong primes in the generation of an RSA key. This paper suggests a fast way of generating random strong primes that also satisfy a number of other cryptographic requirements. The method requires no more time to generate strong primes than it takes to generate random primes.
متن کاملA Rapid Generation Scheme of Large Primes
RSA is by far the most widely adopted standard in public key cryptography algorithm. Its security depends on the Integer Factorization Problem, that it is very easy to calculate the product of two large prime numbers, but the decomposition the product and get the prime factors are very difficult. Therefore, the generations of large primes are important research field. This paper presented a rap...
متن کاملLarge primes and Fermat factors
A systematic search for large primes has yielded the largest Fermat factors known.
متن کاملLarge Sophie Germain primes
If P is a prime and 2P+1 is also prime, then P is a Sophie Germain prime. In this article several new Sophie Germain primes are reported, which are the largest known at this time. The search method and the expected search times are discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1979
ISSN: 0304-3975
DOI: 10.1016/0304-3975(79)90002-1